The MM \sum\limits_{k = 1}^K {} CPPk/GE/c/L G-Queue and Its Application to the Analysis of the Load Balancing in MPLS Networks

نویسندگان

  • Ram Chakka
  • Tien Van Do
چکیده

1. The MM ∑K k=1 CPPk/GE/c/L G-Queue It is well known that the traffic in today’s telecommunication systems often exhibits burstiness i.e. batches of transmission units (e.g. packets) arrive together with correlation among the interarrival times [12]. Several models have been proposed to model such arrival-service processes, queues and networks. These include the compound Poisson process (CPP) in which the interarrival times have generalised exponential (GE) probability distribution [8], the Markov modulated Poisson process (MMPP) and the self-similar traffic models such as the Fractional Brownian Motion (FBM) [11]. The CPP and the ∑K k=1 CPPk traffic models often give a good representation of the burstiness (batch size distribution) of the traffic from one or more sources [7], but not the auto-correlations of the interarrival time observed in real traffic. Conversely, the MMPP models can capture the auto-correlations but not the burstiness [9, 14]. The self-similar traffic models such as the FBM can represent both burstiness as well as auto-correlations, but they are analytically intractable in a queueing context. Often, the traffic to a node is the superposition of traffic from a number of sources, complicating the system analysis further. The MM CPP/GE/c/L G-queue has been capable of accommodating large batch sizes of arrivals and services with an efficient solution in the Markovian framework [2]. However it suffers from the restriction on the batch size distribution (i.e. geometric batch size distribution). In order to overcome that restriction, to make the model vastly flexible and also to accommodate the superposition of multiple arrival streams, a new traffic/queueing model, the Markov modulated ∑K k=1 CPPk/GE/c/L G-queue is introduced [4]. This is a homogeneous multi-server queue with c servers, GE service times and with the superposition of K independent positive and an independent negative1 customer arrival

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of MPLS Multipath Routing with the failure and repair of LSPs

Efficient operation of multipath routing is considered as one of the important aspects in MPLS traffic engineering. Multipath routing has an advantage over the traffic routing based on single shortest paths because single path routing may lead to unbalanced traffic situations and degraded QoS (Quality of Service). This paper proposes a novel model for the performance evaluation of multipath rou...

متن کامل

The MM sum(k=1 to K of CPPk/GE/c/L) G-queue with heterogeneous servers: Steady state solution and an application to performance evaluation

A new queue, referred to here as the HetSigma queue, in the Markovian framework, is proposed in order to model nodes in modern telecommunication networks. The queue has many of the necessary ingredients, such as joint (or individual) Markov modulation of the arrival and service processes, superposition of K CPP (compound Poisson process) streams of (positive) customer arrivals, and a CPP of neg...

متن کامل

A Performance Model of MPLS Multipath Routing with Failures and Repairs of the LSPs

Efficient operation of multipath routing is considered as one of the most important aspects for the success of MPLS traffic engineering. Multipath routing has an advantage over the traffic routing based on single shortest paths because single path routing may lead to unbalanced traffic situations and degraded QoS (Quality of Service). This paper proposes a novel analytical queueing model for th...

متن کامل

A Generalized Markovian Queue and Its Applications to Performance Analysis in Telecommunications Networks

In this paper the MM ∑K k=1 CPPk/GE/c/L G-queue is introduced and proposed as a generalised Markovian node model in telecommunications networks. An exact and computationally efficient solution is obtained for the steady-state probabilities and performance measures. Issues concerning the computational effort are also discussed. The proposed queue is applied to the performance analysis of optical...

متن کامل

A Generalized Markovian Queue to Model an Optical Packet Switching Multiplexer

Packet and burst switching have been proposed for optical networks because they can better accommodate bursty traffic generated by IP applications. In optical packet switching networks the payload and the header of the same packet are conveyed in the same channel, while burst switching networks allow the separate transportation of the payload and the header of the same burst. In this paper we c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002